Symbolic Bisimulation for Quantum Processes
نویسندگان
چکیده
منابع مشابه
Open Bisimulation for Quantum Processes
Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open bisimulation for quantum processes and show that it provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between quantum processes. We also give a modal characterisation of open bisimulation, by extending the Hennessy-Mil...
متن کاملA probabilistic branching bisimulation for quantum processes
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate. Moreover, to model concurrent and distributed quantum computations, as well as quantum communication protocols, quantum to quantum communications which move qubits physically from one place to ano...
متن کاملSymbolic Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is deened, following the approach taken for message passing CCS in HL95a], altered to take account of the particular features of LOTOS (multi-way synchronisation, value negotiation, selection predicates). Symbolic bisimulation over symbolic transition systems is deened, and symbolic bisimulation on ground behaviour expr...
متن کاملSymbolic Bisimulation Minimisation
We adapt the Coarsest Partition Reenement algorithm to its computation using the speciic data structures of Binary Decision Diagrams. This allows to generate symbolically the set of equivalence classes of a nite automaton with respect to bisim-ulation, without constructing the automaton itself. These equivalence classes represent of course the (new) states of the canonical minimal automaton bis...
متن کاملSymbolic Bisimulation for the Applied Pi Calculus
We propose a symbolic semantics for the finite applied pi calculus.The applied pi calculus is a variant of the pi calculus with extensions formodelling cryptographic protocols. By treating inputs symbolically, oursemantics avoids potentially infinite branching of execution trees due toinputs from the environment. Correctness is maintained by associatingwith each process a se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2014
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2579818